2-limited broadcast domination on grid graphs
نویسندگان
چکیده
We establish upper and lower bounds for the 2-limited broadcast domination number of various grid graphs, in particular Cartesian product two paths, a path cycle, cycles. The are derived by explicit constructions. obtained via linear programming duality finding fractional multipacking numbers these graphs.
منابع مشابه
On independent domination numbers of grid and toroidal grid directed graphs
A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...
متن کاملEternal domination on 3 × n grid graphs
In the eternal dominating set problem, guards form a dominating set on a graph and at each step, a vertex is attacked. After each attack, if the guards can “move” to form a dominating set that contains the attacked vertex, then the guards have successfully defended against the attack. We wish to determine the minimum number of guards required to successfully defend against any possible sequence...
متن کاملBroadcast Domination on Block Graphs in Linear Time
A broadcast domination on a graph assigns an integer value f(u) ≥ 0 to each vertex u, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. The Broadcast Domination problem seeks to compute a broadcast domination where the sum of the assigned values is minimized. We show that Broadcast Domination can be solved in linear time on block graphs. For general g...
متن کاملPerfect domination in regular grid graphs
We show there is an uncountable number of parallel total perfect codes in the integer lattice graph Λ of R. In contrast, there is just one 1-perfect code in Λ and one total perfect code in Λ restricting to total perfect codes of rectangular grid graphs (yielding an asymmetric, Penrose, tiling of the plane). We characterize all cycle products Cm × Cn with parallel total perfect codes, and the d-...
متن کاملPerfect domination in rectangular grid graphs
A dominating set S in a graph G is said to be perfect if every vertex of G not in S is adjacent to just one vertex of S. Given a vertex subset S of a side Pm of an m×n grid graph G, the perfect dominating sets S in G with S = S ∩ V (Pm) can be determined via an exhaustive algorithm Θ of running time O(2m+n). Extending Θ to infinite grid graphs of width m − 1, periodicity makes the binary decisi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2023
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2023.05.031